Matrix product codes over finite commutative Frobenius rings
نویسندگان
چکیده
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product codes are also explicitly described in terms of matrix product codes.
منابع مشابه
Codes over affine algebras with a finite commutative chain coefficient ring
We consider codes defined over an affine algebra A = R[X1, . . . , Xr]/ 〈t1(X1), . . . , tr(Xr)〉, where ti(Xi) is a monic univariate polynomial over a finite commutative chain ring R. Namely, we study the A−submodules of A (l ∈ N). These codes generalize both the codes over finite quotients of polynomial rings and the multivariable codes over finite chain rings. Some codes over Frobenius local ...
متن کاملSelf-dual codes over commutative Frobenius rings
We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual codes by lifting elements from the base finite field. We generalize the building-up construction for ...
متن کاملA note on the Singleton bounds for codes over finite rings
In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The Singleton bounds for linear codes over such rings satisfy d(C) − 1 A ≤ n− log|R| |C|. keywords : Linear codes, General weight, Quasi-Frobenius ring, Singleton bounds
متن کاملSingleton Bounds for Codes over Finite Rings
We introduce the Singleton bounds for codes over a finite commutative quasi-Frobenius ring.
متن کاملParity check systems of nonlinear codes over finite commutative Frobenius rings
The concept of parity check matrices of linear binary codes has been extended by Heden [9] to parity check systems of nonlinear binary codes. In the present paper we extend this concept to parity check systems of nonlinear codes over finite commutative Frobenius rings. Using parity check systems, results on how to get some fundamental properties of the codes are given. Moreover, parity check sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 71 شماره
صفحات -
تاریخ انتشار 2014